Qué (quién) es backward chaining - definición

METHOD OF FORMING INFERENCES

Working backward from the goal; Backward reasoning; Backwards reasoning; Goal-oriented inference

backward chaining

<algorithm> An algorithm for proving a goal by recursively breaking it down into sub-goals and trying to prove these until facts are reached. Facts are goals with no sub-goals which are therefore always true. Backward training is the program execution mechanism used by most logic programming language like Prolog. Opposite: forward chaining. (2004-01-26)

Backward chaining

Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications.

https://en.wikipedia.org/wiki/Backward_chaining

Backward chaining (applied behavior analysis)

TECHNIQUE USED IN APPLIED BEHAVIOR ANALYSIS TO TEACH INDIVIDUALS WITH DEVELOPMENTAL DISABILITIES COMPLEX TASKS BY BREAKING THEM DOWN INTO DISCRETE RESPONSES OR INDIVIDUAL BEHAVIORS

Backward Chaining (Applied Behavior Analysis)

Chaining is a technique used in applied behavior analysis to teach complex tasks by breaking them down into discrete responses or individual behaviors that are part of a task analysis. With a backward chaining procedure the learning can happen in two ways.

https://en.wikipedia.org/wiki/Backward_chaining_(applied_behavior_analysis)

Wikipedia

Backward chaining

Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications.

In game theory, researchers apply it to (simpler) subgames to find a solution to the game, in a process called backward induction. In chess, it is called retrograde analysis, and it is used to generate table bases for chess endgames for computer chess.

Backward chaining is implemented in logic programming by SLD resolution. Both rules are based on the modus ponens inference rule. It is one of the two most commonly used methods of reasoning with inference rules and logical implications – the other is forward chaining. Backward chaining systems usually employ a depth-first search strategy, e.g. Prolog.

https://en.wikipedia.org/wiki/Backward chaining